人工神经网络在SARS疫情分析与预测中的应用

讨论人工神经网络在 SARS疫情分析与预测中的应用 .采用三层结构的反向传播网络 ( Backpropagation network,简称 BP网络 ) ,对 SARS在中国的传播与流行趋势及控制策略建立了网络模型 .并利用实际数据拟合参数 ,针对北京、山西的疫情进行了计算仿真 .结果表明 ,该网络模型算法收敛速度较快 ,预测精度很高     

HIGH ACCURACY NUMERICAL METHOD OF THIN-FILM PROBLEMS IN MICROMAGNETICS

In this paper, a new high accuracy numerical method for the thin-film problems of micron and submicron size ferromagnetic elements is proposed. For the computation of stray field, we use the finite element method(FEM) by introducing a semi-discrete artificial boundary condition [1, 2]. In our numerical experiments about the domain patterns and their movement, we can see that the results are accordant to that of experiments and other numerical methods. Our method are very convenient to deal with arbitrary shape of thin films such as a polygon with high accuracy.     

凹角区域双曲外问题的精确人工边界条件

研究一类凹角区域双曲型外问题的数值方法.先用Newmark方法对时间进行离散化,在每个时间步求解一个椭圆外问题.然后引入人工边界,并获得精确的人工边界条件.给出半离散化问题的变分问题,证明了变分问题的适定性,并给出了误差估计.最后给出数值例子,以示该方法的可行性与有效性.     

微纳米加工技术在纳米物理与器件研究中的应用

物质在纳米尺度下可能呈现出与体材料不同的物理特件，这正是纳米科技发展的基础之一。要想探索在纳米尺度下材料物埋性质的变化规律及可能的应用领域，离不开相应的技术手段，微纳米加工技术作为当今高技术发展的重要技术领域之一，是实现功能人工纳米结构与器件微纳米化的基础。本文根据几个不同的应用领域，介绍了微纳米加工技术在纳米物理与器件研究领域的应用。     

On Numerical Solution of Shape Inverse Problems

The new method is proposed for the numerical solution of a class of shape inverse problems. The size and the location of a small opening in the domain of integration of an elliptic equation is identified on the basis of an observation. The observation includes the finite number of shape functionals. The approximation of the shape functionals by using the so-called topological derivatives is used to perform the learning process of an artificial neural network. The results of computations for 2D examples show, that the method allows to determine an approximation of the global solution to the inverse problem, sufficiently closed to the exact solution. The proposed method can be extended to the problems with an opening of general shape and to the identification problems of small inclusions. However, the mathematical theory of the proposed approach still requires futher research. In particular, the proof of global convergence of the method is an open problem.     

Rapprochement of artificial intelligence and dynamics

It is proposed that continuous time is in effect discretized in the brain by dynamic pattern recognition mechanisms in neurons. Time discretization is required to support formal computations in continuous time systems consisting of a large number of components. The ability to perform formal computations is necessary if the system is to execute high level algorithms of the type used in present day artificial intelligence. The weakness of such algorithms is that they work efficiently only when the forms of patterns and objects presented to them are highly constrained. The dynamic mechanisms which discretize the brain's time line also serve to code patterns into constrained forms suitable for high level processing.     

基于DIGNET网络的数据融合方法

针对数据融合和目标识别的特点,提出了基于DIGNET自组织聚类人工神经网络的数据融合方法。考虑到多传感器系统测量多个参量的特点,用并行的子网络结构代替中间隐层,实现了基于决策层的信息融合目标识别。利用仿真数据对基于DIGNET的数据融合方法进行了实验研究。实验结果表明,该方法具有数据正确分类率高和抗噪能力强等优点,有效地实现了融合识别。将该方法应用于前视红外和可见光双传感器目标跟踪系统的数据融合识别是可行的。     

Numerical simulation on an interaction of a vortex street with an elliptical leading edge using an unstructured grid

An algorithm for a time accurate incompressible Navier–Stokes solver on an unstructured grid is presented. The algorithm uses a second order, three‐point, backward difference formula for the physical time marching. For each time step, a divergence free flow field is obtained based on an artificial compressibility method. An implicit method with a local time step is used to accelerate the convergence for the pseudotime iteration. To validate the code, an unsteady laminar flow over a circular cylinder at a Reynolds number of 200 is calculated. The results are compared with available experimental and numerical data and good agreements are achieved. Using the developed unsteady code, an interaction of a Karman vortex street with an elliptical leading edge is simulated. The incident Karman vortex street is generated by a circular cylinder located upstream. A clustering to the path of the vortices is achieved easily due to flexibility of an unstructured grid. Details of the interaction mechanism are analysed by investigating evolutions of vortices. Characteristics of the interactions are compared for large‐ and small‐scale vortex streets. Different patterns of the interaction are observed for those two vortex streets and the observation is in agreement with experiment. Copyright © 2004 John Wiley & Sons, Ltd.     

直接求线性规划可行基的一种方法

本文给出直接求线性规划问题基可行解的一种简易方法,该方法既避免了引入人工变量,减少存储,一般又能较快地得到一个较好的基可行解.     

Branch and win: OR tree search algorithms for solving combinatorial optimisation problems

Currently, most combinatorial optimisation problems have to be solved, if the optimum solution is sought, using general techniques to explore the space of feasible solutions and, more specifically, through exploratory enumerative procedures in trees and search graphs. We propose Branch and Win, a general formulation for understanding and synthesising the different tree search procedures that have been presented in the literature of operations research as well as in that of artificial intelligence. Several general ideas are also presented, whose application allows designing new hybrid search algorithms, in order to implement the procedure.